Global Minimization of a Multivariate Polynomial using Matrix Methods
نویسندگان
چکیده
The problem of minimizing a polynomial function in several variables over R n is considered and an algorithm is given. When the polynomial has a minimum the algorithm returns the global minimum and nds at least one point in every connected component of the set of minimizers. A characterization of such points is given. When the polynomial does not have a minimum the algorithm can compute its innmum. No assumption is made on the polynomial. The algorithm can be applied for solving a system of polynomial equations.
منابع مشابه
Determination of a Matrix Function in the Form of f(A)=g(q(A)) Where g(x) Is a Transcendental Function and q(x) Is a Polynomial Function of Large Degree Using the Minimal Polynomial
Matrix functions are used in many areas of linear algebra and arise in numerical applications in science and engineering. In this paper, we introduce an effective approach for determining matrix function f(A)=g(q(A)) of a square matrix A, where q is a polynomial function from a degree of m and also function g can be a transcendental function. Computing a matrix function f(A) will be time- consu...
متن کاملGlobal minimization of a mutivariate polynomial using matrix methods
The problem of minimizing a polynomial function in several variables over Rn is considered and an algorithm is given. When the polynomial has a minimum the algorithm returns the global minimum and nds at least one point in every connected component of the set of minimizers. A characterization of such points is given. When the polynomial does not have a minimum the algorithm can compute its in m...
متن کاملAn nD-systems approach to global polynomial optimization with an application to H2 model order reduction
The problem of finding the global minimum of a multivariate polynomial can be approached by the matrix method of Stetter-Möller, which reformulates it as a large eigenvalue problem. The linear operators involved in this approach are studied using the theory of nD-systems. This supports the efficient application of iterative methods for solving eigenvalue problems such as Arnoldi methods and Jac...
متن کاملGlobal Optimization of Rational Multivariate Functions
The paper deals with unconstrained global minimization of rational functions. A necessary condition is given for the function to have a nite innmum. In case the condition is satissed, the problem is shown to be equivalent to a speciic constrained polynomial optimization problem. In this paper, we solve a relaxation of the latter formulation using semi-deenite programming. In general, the relaxa...
متن کاملMinimizing Polynomials via Sum of Squares over the Gradient Ideal
A method is proposed for finding the global minimum of a multivariate polynomial via sum of squares (SOS) relaxation over its gradient variety. That variety consists of all points where the gradient is zero and it need not be finite. A polynomial which is nonnegative on its gradient variety is shown to be SOS modulo its gradient ideal, provided the gradient ideal is radical or the polynomial is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Global Optimization
دوره 27 شماره
صفحات -
تاریخ انتشار 2003